Generating content snippets using a tokenspace repository

ABSTRACT

A search engine server system receives from a client system a search query and identifies a set of documents in accordance with the search query. A content snippet corresponding to content in a respective document of the identified set of documents is generated, the content snippet associated with at least one query term of the one or more query terms in the search query. A response to the search query is returned to the client system, the response including information identifying at least the respective document and including the content snippet. Generating the content snippet includes performing a first decompression operation on first token identifiers, from a compressed document repository, to provide a set of second token identifiers, and performing a second decompression operation on the set of second token identifiers to recover uncompressed content comprising a portion of the respective document.

RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.13/040,220, filed Mar. 3, 2011, now U.S. Pat. No. 8,321,445, which is acontinuation application of U.S. application Ser. No. 10/917,739, filedAug. 13, 2004, now U.S. Pat. No. 7,917,480, which are incorporatedherein by reference in their entirety.

This application is related to U.S. patent application Ser. No.10/917,745, filed Aug. 13, 2004, entitled “System and Method ForEncoding And Decoding Variable-Length Data,” and U.S. patent applicationSer. No. 10/917,746, filed Aug. 13, 2004, entitled “Multi-Stage QueryProcessing System And Method For Use With Tokenspace Repository”, bothof which are incorporated by reference herein in their entirety

TECHNICAL FIELD

The disclosed embodiments relate generally to data processing systemsand methods, and in particular to a document compression system andmethod for use with a collection of documents with an associated index(hereinafter also referred to as a “tokenspace repository”).

BACKGROUND

Information retrieval systems (e.g., search engines), match queriesagainst an index of documents generated from a document corpus (e.g.,the World Wide Web). A typical inverse index includes the words in eachdocument, together with pointers to their locations within thedocuments. A document processing system prepares the inverted index byprocessing the contents of the documents, pages or sites retrieved fromthe document corpus using an automated or manual process. The documentprocessing system may also store the contents of the documents, orportions of the content, in a repository for use by a query processorwhen responding to a query.

There is a continuing need for more sophisticated query searching andscoring techniques to ensure that query results are relevant to thequery. Some scoring techniques may require a partial reconstruction ofthe candidate documents, for example to determine the context of queryterms or keywords found in the documents. Unfortunately, introducingsuch sophisticated techniques can result in a degradation of searchperformance due to the additional processing and overhead involved.

SUMMARY OF EMBODIMENTS

A search engine server system, while performing a query processingmethod, receives from a client system a search query having one or morequery terms, and identifying a set of documents in accordance with thesearch query. The system generates a content snippet corresponding tocontent in a respective document of the identified set of documents, thecontent snippet associated with at least one query term of the one ormore query terms in the search query. The system furthermore returns tothe client system a response to the search query, the response includinginformation identifying at least the respective document and includingthe content snippet of the respective document. Generating the contentsnippet includes receiving a set of first token identifiers from acompressed document repository, the set of first token identifiershaving a range of positions in the compressed document repositorycorresponding to positions at which a subset of the respective documentis stored in the repository, and performing a first decompressionoperation by applying one or more first mappings to the set of firsttoken identifiers to provide a set of second token identifiers. A seconddecompression operation is performed by applying a second mapping to theset of second token identifiers to recover uncompressed contentcomprising a portion of the respective document.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an embodiment of a information retrievalsystem.

FIG. 2 is a conceptual block diagram of an embodiment of the lexicongenerator of FIG. 1.

FIG. 3A is a block diagram of an embodiment of an encoding system forencoding documents for a tokenspace repository.

FIG. 3B is a block diagram of an embodiment of a decoding system fordecoding documents in a tokenspace repository.

FIG. 3C is a block diagram of an embodiment of an attributeencoding/decoding system for encoding/decoding document attributes.

FIG. 4 is a block diagram of an embodiment of a query processing systemfor use with a tokenspace repository.

FIG. 5 is a block diagram of an embodiment of a multi-stage queryprocessing system for use with a tokenspace repository.

FIG. 6 is a block diagram of an embodiment of a tokenspace repositoryserver.

FIG. 7 is a block diagram of an embodiment of a query processing server.

FIG. 8 a is a block diagram of a second embodiment of a tokenizeddocument repository, and FIG. 8 b is a conceptual block diagram of asecond embodiment of the lexicon generator of FIG. 1.

FIG. 9A is a conceptual diagram of an encoding process used in theembodiment of the lexicon generator, and FIG. 9B depicts exemplary datastructures for representing encoded tokens.

Like reference numerals refer to corresponding parts throughout theseveral views of the drawings.

DESCRIPTION OF EMBODIMENTS System Overview

FIG. 1 is a block diagram of an embodiment of an information retrievalsystem 100. The information retrieval system 100 includes a documentprocessing system 102 and a query processing system 104. The informationretrieval system 100 can be any system that is capable of retrievinginformation in response to a query, including but not limited to one ormore computer systems for performing expressed or implicit documentsearches on one or more networks, such as the Internet (e.g., via theWorld Wide Web) or an intranet, or locally on a user's computer (e.g.,of files, email, applications, etc.). Note that the term “documents”means documents, web pages, emails, application specific documents anddata structures, Instant Messaging (IM) messages, audio files, videofiles, and any other data or applications that may reside on one or morecomputer systems.

Document Processing System

The document processing system 102 generally includes one or moredocument repositories 106, a lexicon generator 108, an encoding/decodingsystem 110 and a tokenspace repository 112. The encoding/decoding system110 retrieves documents from the one or more document repositories 106,parses the documents into tokens, encodes the tokens into a compressedformat using mappings from the lexicon generator 108, then stores theencoded tokens in the tokenspace repository 112.

A “token” can be any object typically found in a document, including butnot limited to terms, phrases, punctuation, HTML tags and the like.After parsing, a set of documents is represented as a sequence oftokens. Furthermore, each token in the sequence of tokens has a tokenposition, which also represents the position of the token in the set ofdocuments. For example, the first token in the set of documents may beassigned a position of 0, the second token in the set of documents maybe assigned a position of 1, and so on.

It is noted that in some implementations, a completely different set ofcomputers are used for encoding documents than the computers used fordecoding documents. For instance, a web crawling system may include adocument processing system 102 that encodes documents, while a queryprocessing system 104 may decode selected portions of the encodeddocuments. In such implementations, the document inverse index andtokenspace repository 112 built by the document processing system 102,or copies thereof, are used by the query processing system 104.

The lexicon generator 108 generates the mappings used for encoding a setof documents by parsing the documents. A first mapping produced by thelexicon generator 108 is herein called the global-lexicon, whichidentifies all distinct tokens (herein called unique tokens) in the setdocuments, and assigns a global token identifier to each unique token. Asecond mapping produced by the lexicon generator 108 is actually asequence of mappings, each of which is herein called a mini-lexicon.Each respective mini-lexicon is used only for encoding and decoding arespective range of positions in the set of documents. The generationand use of the global-lexicon and the mini-lexicons are explained inmore detail below.

Query Processing System

The query processing system 104 includes one or more query processors114 coupled to the encoding/decoding system 110 and a tokenspace inverseindex 116. The tokenspace inverse index 116 maps all the GTokenIDs inthe set of documents to their positions within the documents.Conceptually, the inverse index 116 contains a list of token positionsfor each GTokenID. For efficiency, the list of token positions for eachGTokenID is encoded so as to reduce the amount of space occupied by theinverse index.

In some embodiments, the one or more query processor(s) 114 parse aquery into multiple query terms which are transformed by the one or morequery processors 114 into a query expression (e.g., Boolean treeexpression). The query terms are used to index the tokenspace inverseindex 116 to retrieve token positions, as described more fully withrespect to FIG. 4. In some embodiments, the token positions are used ina multi-stage query processing system for scoring documents relevant tothe query, as described with respect to FIG. 5. In response to the queryterms, the query processors 114 generate an ordered list of documentswhich are presented to the user via one or more modes of communication(e.g., display device, audio, etc.).

Lexicon Generator

FIG. 2 is a conceptual block diagram of an embodiment of the lexicongenerator 108 of FIG. 1. The lexicon generator 108 includes aglobal-lexicon builder 202 and a mini-lexicon builder 204.

Global-Lexicon Builder

The global-lexicon builder 202 retrieves documents from the documentrepository 106 and generates a global-lexicon 206 by assigning uniqueglobal token identifiers (GTokenIDs) to each unique token contained inthe documents. In some embodiments, the document repository 106 islogically or physically split into multiple portions, sometimes calledpartitions, and a separate global-lexicon 206 is generated for eachpartition. In one embodiment, a set of several billion documents isdivided into several thousand partitions, each of which is processed togenerate a global-lexicon 206. A typical global-lexicon 206 can includea few million unique tokens.

In some embodiments, the set of documents to be encoded (e.g., thedocuments in one partition) are sorted in accordance with one or morecriteria prior to the parsing of the documents into tokens and theprocessing of the tokens. Such sorting of the documents can facilitateefficient encoding of the tokenized documents, because documents thatuse similar sets of words will be positioned near each other in the setof documents. As a result, each mini-lexicon (described below) will, onaverage, cover a larger portion of the set of documents than wouldotherwise be the case, and more generally, the encoding of the documentswill occupy less space. In one embodiment, the set of documents arefirst sorted by language, and then the documents for each language aresorted by URL, with the fields of the host name portion of the URL beingreversed in order. For example, after the sorting by language, all theFrench documents will be grouped together, and then the French documentswill be sorted by URL. When sorting by URL, each URL initially comprisesa pattern of h1.h2 . . . hy.hz/n1/n2 . . . , where h1.h2 . . . hy.hzcomprises the host name portion of the URL and /n1/n2 represents theremainder of the URL. The URL is remapped to the pattern hz.hy . . .h2.h1/n1/n2 . . . prior to the sorting by URL. For example, the URL“www.google.com/about.html” is remapped to “com.google.www/about.html”.By reversing the host name fields of the URLs prior to sorting by URL,the documents are sorted in accordance with their logical proximity toeach other. Thus, similar types of documents (within the group ofdocuments for a particular language) are grouped together; within thegroup of documents for each document type, documents on each web siteare grouped together; within the documents for each website, thedocuments for various branches of the website are grouped together; andso on.

In some embodiments, the documents are ordered using one or moreclustering techniques. Terms, words or phrases contained in documentscan be used to organize the documents into clusters that relate tovarious concepts. For example, general information about the documents(e.g., meta-data embedded in or otherwise associated with the identifieddocuments), sampled content from the identified documents, and/orcategory information about the documents can be used to order thedocuments.

In some embodiments, while parsing the documents the global lexiconbuilder 202 stores information (not shown in FIG. 2) about eachidentified unique token, such as the number of occurrences of eachunique token in the set of documents, and the language (if any)associated with the unique token. The language associated with a uniquetoken may be determined based on the language associated with thedocument(s) in which the token is found. When a particular token isfound in documents associated with more than language, the languageassociated with the token may be determined using any suitablemethodology. One suitable methodology is a statistical methodology thatis used while parsing the set of documents to identify unique tokens.Each token is initially assigned to the language of the first documentin which it is found, and then for each subsequent occurrence of thetoken that occurs in a document of a language other than the currentlanguage assigned to the token, the token is reassigned to the otherlanguage only if a randomly (or pseudo-randomly) selected number between0 and 1 is less than 1/N, where N is the current count of occurrences ofthe token. In other embodiments, any similar or otherwise suitablelanguage assignment mechanism can be used to associate a language witheach unique token. In some embodiments, a language is not associatedwith the unique tokens representing punctuation symbols. In yet anotherembodiment, while a language may be associated with every unique token,the language association is ignored when processing the N (e.g., 256)most frequently occurring tokens. As a result, the language associatedwith punctuation tokens is effectively ignored.

In some embodiments, the list of unique tokens, and the associatedfrequency and language information, is sorted based on frequency ofoccurrence of the unique tokens. Optionally, the entries can then befurther sorted to facilitate space efficient encoding of the set ofdocuments. For instance, in one embodiment, all the unique tokens arefirst sorted by frequency of occurrence. The resulting sorted list ofunique tokens is then divided into bands. For instance, the top band,Band 0, may comprise the top 255 or 256 tokens (i.e., those with thehighest frequency counts). The second band, Band 1, may comprise the top2¹⁴ (i.e., 65,536) tokens, excluding the tokens in Band 0. The thirdband, Band 2, may comprise the next 2¹⁴ (i.e., 65,536) tokens in thesorted list of unique tokens. Of course, the number of tokens in eachband may differ in other embodiments. Next, the tokens in each band aresorted in accordance with a second set of criteria. For instance, in oneembodiment, the tokens in the first band are sorted alphabetically, thatis by numeric or alphabetic value. Each of the other bands are sortedfirst by language, and then alphabetically. As a result, the sortedtokens in each band other than Band 0 are grouped by language, andwithin each language group the tokens are sorted alphabetically. Inother embodiments, other sorting criteria may be used for sorting theunique tokens in each of the bands.

The sorting process produces a sorted list of the unique tokens, eachhaving a respective position in the list. Each sorted unique token isthen assigned a unique global token identifier (hereinafter alsoreferred to as “GTokenID”). GTokenIDs can include any suitable data typeand width depending upon the platform used to implement the documentprocessing system 102 (e.g., 32-bit unsigned integers). In someembodiments, GTokenIDs are assigned to the sorted unique tokens inincreasing order, so that high-frequency tokens are assigned smallvalued GTokenIDs and low-frequency tokens are assigned large valuedGTokenIDs. To be more specific, in one embodiment, each token in thesorted list of tokens is assigned a 32-bit global token identifier equalto its numeric position in the sorted list of unique tokens. Thus, thefirst token in the list is assigned a GTokenID equal to 0 (i.e.,00000000 in hexadecimal format), the second token in the list isassigned a GTokenID equal to 1, and so on. The resulting set of mappingsof GTokenIDs to unique token values is herein called the global-lexicon206. In some embodiments, the global lexicon 206 actually comprises twomapping structures, one which maps GTokenIDs to tokens, and another thatmaps tokens to GTokenIDs. The mapping of tokens to GTokenIDs is usedduring the encoding process, while the mapping of GTokenIDs to tokens isused while decoding portions of the documents.

As will be explained more fully below, ordering the unique tokens basedon frequency helps reduce the amount of space required for storing themini-lexicons 208. This is true even in those embodiments in which bandsof the unique tokens are sorted based on criteria other than frequencyof occurrence, because the tokens in the bands assigned to lowerGTokenIDs have higher frequencies of occurrence than the tokens in thebands assigned to higher GTokenIDs.

In some embodiments, “special” tokens that occur more frequently thanthe average token, such as HTML tags and punctuation, are assignedGTokenIDs which occupy a prefix 205 portion of GTokenIDs in theglobal-lexicon 206 (e.g., GTokenID₀-GTokenID_(N-1)). All other GTokenIDscan be offset by the last special GTokenID allocated to the prefix 205.

In the above discussion, the GTokenIDs are described as fixed lengthvalues, such as 32-bit unsigned integer values. However, these sameGTokenIDs can also be considered to be variable length identifiers,because when the GTokenIDs are encoded for storage, the most significantbytes (or bits) that are equal to zero may be truncated or masked offduring encoding. For instance, in some embodiments, all GTokenIDs with avalue of less than 2⁸ are encoded as a single byte value, all GTokenIDswith a value of less than 2¹⁶ are encoded as a two-byte value, and allGTokenIDs with a value of less than 2²⁴ are encoded as a three-bytevalue. In this way, the tokens having the highest frequencies ofoccurrence in the set of documents are represented by shorter lengthGTokenIDs than the tokens having lower frequencies of occurrence.

In the embodiments described below, the tokenspace repository ispopulated with fixed length LTokenIDs, rather than the variable-lengthGTokenIDs. However, mapping the LTokenIDs in the tokenspace repositoryback to the original tokens (which are also of variable length, ofcourse) requires the storage of a large number of “mini-lexicons”, andthe content of the mini-lexicons comprises GTokenIDs. To efficientlystore the mini-lexicons, the GTokenIDs in each mini-lexicon may betreated as variable length values. Alternately, the GTokenIDs in eachmini-lexicon may be treated as a list that is first delta encoded, andthen the resulting delta values are encoded using a variable lengthencoding scheme.

Mini-Lexicon Builder

After the global-lexicon 206 is generated, a set of mini-lexicons 208are generated by the mini-lexicon builder 204 for use by theencoding/decoding system 110. Each entry in a mini-lexicon 208 includesa GTokenID and a corresponding local token identifier (LTokenID). TheLTokenID for each entry is implied by the position of the entry in themini-lexicon 208, and therefore does not need to be explicitly stored.Each respective mini-lexicon 208 is used only for encoding and decodinga distinct, respective specific range of token positions in thetokenized documents, thus allowing the same set of LTokenIDs to be usedby each mini-lexicon 208. For example, a first mini-lexicon 208 (e.g.,mini-lexicon A) having P (e.g., 256) entries is generated for the firstP unique tokens encountered by the mini-lexicon builder 204 as it parsesthrough the documents. Once the first P unique tokens have beenencountered, a first entry in a “valid range map” 210 is made whichincludes the starting token position, Start_Pos_(A), for the range oftoken positions for which the first mini-lexicon 208 is valid. Each ofthe P LTokenIDs in the first mini-lexicon 208 is assigned to a uniqueGTokenID. When all of the LTokenIDs have been assigned to GTokenIDs, asecond mini-lexicon 208 (e.g., mini-lexicon B) is generated for the nextP unique tokens encountered by the mini-lexicon builder 204, and asecond entry is made in the valid range map 210 which includes thestarting token position, Start_Pos_(B), of the range of positions forwhich the second mini-lexicon 208 is valid. Thus, a token having aposition in the tokenized documents that falls within the rangeStart_Pos_(B) to Start_Pos_(C)−1 can be decoded using mini-lexicon B, asshown in FIG. 2.

To provide a concrete example, in one embodiment the LTokenIDs in eachmini-lexicon have values from 0 to 255, each represented by an 8-bitunsigned integer, while the GTokenIDs are 32-bit unsigned integers. Afirst mini-lexicon is generated by scanning the set of documents,starting at token position 0, until a predefined number P (e.g., 256) ofdistinct tokens are identified. The GTokenIDs for the P distinct tokensare assembled in a list. In some embodiments, the GTokenIDs in the listare sorted by numeric value, with the smallest GTokenIDs at the top ofthe list. LTokenIDs are then assigned to the GTokenIDs in the list, inaccordance with the positions of the GTokenIDs in the list. Forinstance, the first GTokenID in the list is assigned an LTokenID of 0,the next GTokenID in the list is assigned an LTokenID of 1, and so on.The resulting mapping of LTokenIDs to GTokenIDs is called a mini-lexicon208. A range of token positions, from Start_Pos_(A) to Start_Pos_(B), isassociated with the mini-lexicon. A second mini-lexicon is generated byscanning the set of documents starting at the position Start_Pos_(B)immediately following the last position associated with the firstmini-lexicon. The scanning continues until the predefined number P ofdistinct tokens are identified, at which point a second mini-lexicon isgenerated using the same process as described above. The mini-lexiconbuilder 204 continues to generate a sequence of mini-lexicons 208 forsubsequent ranges of token positions in the set of documents until allthe tokens in the documents have been mapped to mini-lexicons 208.

In an alternate embodiment, the first F LTokenIDs in each mini-lexicon208 are reserved for the F most popular tokens in the set of documents.For these F LTokenIDs, the LTokenID is always equal to the GTokenID.This assignment scheme facilitates fast decoding of documents. Wheneveran LTokenID (in the tokenspace repository) having a value of F−1 or lessis decoded, it can be mapped to a token directly in accordance with theglobal-lexicon without having to first map the LTokenID to acorresponding GTokenID.

The same set of LTokenIDs (e.g., 0 to 255) are used in each mini-lexicon208. To facilitate compression of the documents, the LTokenIDs have asmaller width (e.g., 1 byte) than the GTokenIDs (e.g., 4 bytes). Thedifference of these widths (e.g., 3 bytes) represents a reduction in thenumber of bytes per token used to store the tokenized documents in thetokenspace repository 112. In an embodiment in which each LTokenIDoccupies one byte, a set of documents having 1 billion tokens willoccupy 1 billion bytes (1 GB) in the tokenspace repository 112, ignoringthe space occupied by other supporting data structures (which aredescribed later in this document).

When the process of generating mini-lexicons 208 is complete, everytoken in the tokenized documents is associated with a mini-lexicon 208based on its position in the tokenized documents. Note that each uniquetoken in the tokenized documents may be associated with more than onemini-lexicon 208 if the token occurs in more than one position range. Inone embodiment, an average document has approximately 1100 tokens and anaverage mini-lexicon 208 spans around 1000 tokens.

After each mini-lexicon 208 is generated, the tokens in thecorresponding portion of the set of documents is mapped to LTokenIDs bythe encoding/decoding system 110 and stored in the tokenspace repository112 for subsequent retrieval. With this mapping, every token in thedocument repository 106 is mapped to a fixed length (e.g., one byte)LTokenID in the tokenspace repository 112. Thus, duringdecoding/decompression it is possible to jump from one token position toanother in the tokenspace repository 112 without the need of skip tablesor equivalent data structures, which can slow down the decoding process.

In some embodiments, the mini-lexicons 208 are encoded in a compressedformat and stored until needed for document reconstruction. In oneembodiment, the sorted list of GTokenIDs in each mini-lexicon 208 isdelta encoded, and then the resulting list of delta values is encoded ina compressed format, preferably in a format that facilitates fast andefficient decoding and reconstruction of the mini-lexicon. A suitabledata structure and encoding/decoding method are described in co-pendingU.S. patent application Ser. No. 10/917,745, entitled “System and MethodFor Encoding And Decoding Variable-Length Data.”

To decompress a particular document, the mini-lexicons 208 associatedwith the range of token positions for that document are decompressedinto translation tables or mappings built from entries of themini-lexicons 208 which translate the LTokenIDs to their correspondingGTokenIDs. Thus, decoding a tokenized document in the tokenspacerepository 112 is accomplished by reading the fixed-length LTokenIDsstored in the tokenspace repository 112 for the document, and accessingthe mini-lexicon for each token position in the document to translatethe LTokenIDs into corresponding GTokenIDs. The GTokenIDs are thenmapped into the corresponding tokens (e.g., text and punctuation) usingthe global-lexicon 206, thereby reconstructing all or a portion of thedocument.

Encoding System

FIG. 3A is a block diagram of an embodiment of an encoding system 300for encoding documents for a tokenspace repository. The encoding system300 includes an optional preprocessor 302, an optional delta encoder 304and a variable-length data encoder 306. Variable-length data can includevarious data types, such as, without limitation, integers, characterstrings, floating-point numbers, fixed-point numbers and the like. Thevariable-length data includes but is not limited to text, images,graphics, audio samples and the like.

In some embodiments, a list of information is received by thepreprocessor 302 which orders the information for efficient encoding.The preprocessor 302 may order the data into a monotonic sequence usingone or more sorting algorithms. For example, if a set of integers aresorted by value, then adjacent integers will be close in magnitude, thusenabling the delta encoder 304 to generate delta values that are smallvalued integers for encoding. The ordered data is received by the deltaencoder 304, which computes differences between adjacent pairs of theordered data to obtain the small valued integers. The small valuedintegers are received by the variable-length data encoder 306, whichencodes the data into a compressed format which can be efficientlydecoded. One example of a suitable variable-length data encoder 306 isdescribed more fully in co-pending U.S. patent application Ser. No.10/917,745, entitled “System and Method For Encoding And DecodingVariable-Length Data.”

Various information generated by the document processing system 102 canbe encoded using all or part of the encoding system 300. In someembodiments, the GTokenIDs in each mini-lexicon 208 are sorted using thepreprocessor 302 to ensure that integer values closest in magnitude willbe delta encoded. The ordered GTokenIDs are then delta encoded by thedelta encoder 304 to provide difference or residual values. Thedifference values are then encoded in groups (e.g., groups of 4 values)into a compressed format using the variable-length data encoder 306. Insome embodiments, lists of token positions in an inverse index aresimilarly encoded to facilitate fast and efficient decoding of thepositions, as described more fully with respect to FIG. 4.

While the variable-length data encoder 306 provides a compressed formatthat facilitates fast and efficient decoding, other known encodingschemes can also be used in the document processing system 102 tocompress a list of information (e.g., CCITT-G4, LZW etc.).

Decoding System

FIG. 3B is a block diagram of an embodiment of a decoding system 308 fordecoding documents in a tokenspace repository. The decoding system 308includes a variable-length data decoder 310 and an optional deltadecoder 312. In some embodiments, encoded groups of data are received bythe variable-length data decoder 310, which decodes the groups with theassistance of one or more offset/mask tables. The decoded data isreceived by the delta decoder 312, which computes running sums, therebyproducing delta-decoded data, which is equivalent to the original listof information. The use of offset/mask tables in decoding group encodedvariable-length integer values is described more fully in co-pendingU.S. patent application Ser. No. 10/917,745, entitled “System and MethodFor Encoding And Decoding Variable-Length Data.”

Attribute Encoding/Decoding System

FIG. 3C is a block diagram of an embodiment of an attributeencoding/decoding system 314 for encoding/decoding document attributes.The attribute encoding/decoding system 314 includes an encoding/decodingsystem 320 which encodes attribute information 322 into attributerecords 318 for storage in an attribute table 316. The attributes for adocument are determined on a token-by-token basis, with a 0 or 1 bitvalue being used to represent the presence or absence of each attributefor a given token. For instance an attribute record 318 in the attributetable may be conceptually represented as an A×K bit map, where A is thenumber of attributes that are encoded and K is the number of tokenswhose attributes are represented by the record 318. If A is 8 and K is32, then each attribute record 318 stores eight attributes for each of32 tokens. Each attribute record 318 may be encoded so as to compressthe amount of space occupied by the attributes table while enabling veryfast decoding of selected attribute records during query processing. Onesuitable methodology for encoding and decoding the attribute records 318is described in co-pending U.S. patent application Ser. No. 10/917,745,entitled “System and Method For Encoding And Decoding Variable-LengthData.” Alternately, the information in each attribute record may berun-length encoded.

The set of attributes that are recorded in the attribute table 316 caninclude one or more font attributes (e.g., bold, underlined, etc.), oneor more document position attributes (e.g., title, heading), metadataand any other features or characteristics that can be used todistinguish between the tokens in a set of documents. In someembodiments, the attributes of the tokens in a set of documents areidentified and encoded at the same time that the tokenized documents areencoded and stored in the tokenspace repository, as described above. Theencoded attributes are used in one or more stages of relevancy scoring,as described more full with respect to FIG. 5.

Q Document Repository Encoding and Decoding System—Second Embodiment

FIGS. 8A and 8B are block diagrams of an embodiment in which a tokenizedcollection of documents (a “tokenspace repository”) is encoded in asomewhat different way than the one described above. As described above,a global lexicon builder 202 tokenizes the set of documents 106,identifies all unique tokens, and assigns global token identifiers toall the unique tokens. The result is a global lexicon 206. Next, the setof documents (which have been tokenized) are processed by a regionlexicons builder 804. Conceptually, the set of documents are dividedinto regions 820, and each region 820 is divided into blocks 822. Theregion lexicons builder 804 builds a “lexicon” or dictionary 830 foreach region, and an encoding system 810 generates a set of encodedtokens 832 for each region, plus a set of block offsets 834 for eachregion. The region lexicon 830, the encoded tokens 832 and the blockoffsets 834 (each of which will be described in more detail next)together form an encoded representation of a respective region 820 ofthe set of documents.

In one embodiment, the set of documents is divided into regions 820,each of which (except perhaps a last region) has a predetermined, fixedsize, such as 8192 tokens (or any other appropriate size). Each block822 of a region 820 also has a predefined, fixed size, such as 64 tokens(or any other appropriate size).

In one embodiment, the “lexicon” 830 for a respective region 820 is anordered listing of the longest sequences of tokens having the highestrepeat rates, or any similar structure. The lexicon 830 may be built bybuilding a table of candidate token strings in the region, determiningtheir repeat counts within the region, and then selecting the bestcandidates until a maximum lexicon size is reached. In an exemplaryembodiment, the maximum lexicon size is 64 tokens, but any otherappropriate size limit may be used in other embodiments. As will bedescribed next, the lexicon 830 is used as a context for encoding eachof the blocks 822 of the respective region 820, enabling a highlycompressed representation of the region. In some embodiments, one ormore of the region lexicons 830 may be encoded in a compressed format,for instance using the encoding method described in U.S. patentapplication Ser. No. 10/917,745, entitled “System and Method ForEncoding And Decoding Variable-Length Data,” referenced earlier in thisdocument.

Referring to FIGS. 9A and 9B, in one embodiment the encoding system 810encodes each block 822 of tokens as follows. The lexicon 830 for thecorresponding region is treated as a set of tokens that immediatelyprecede the tokens of the block. In sequence, the tokens of the blockare processed from first to last, matching each token and as manysubsequent tokens as possible with the longest matching token sequencein the preceding sequence of tokens, including the lexicon 830. If amatching preceding sequence is found, a “copy code” is generated.Otherwise a “literal code” is generated to represent the token. Alltokens covered by the current code are then treated as preceding tokensfor subsequence processing of the next token (if any) in the block. Asshown in FIG. 9B, each “code” representing the set of tokens in a blockmay include a type field 902. If the code is a “literal code” the secondportion 904 of the code represents the global token identifier. In someembodiments, this type field 902 indicates the number of bits requiredto represent the global token identifier. For example, in oneembodiment, the type code 902 can indicate up to seven distinct literalcodes, each having a corresponding global token identifier length. Inother embodiments, the number of distinct type codes may be more or lessthan eight (e.g., one indicating a copy code and the rest indicatingliteral codes). If the literal code is a “copy code” the second portion906 of the code may include a pointer 908 and a length 910, where thepointer 908 indicates where in the preceding text to start, and thelength 910 indicates the length of the matching sequence (i.e., thenumber of tokens to be copied during decoding). Thus, if a matchingsequence of, say, four tokens is found by the encoding system 810,beginning at a location 31 tokens preceding the current position, thenthe code for this sequence would be:

<type=copy, ptr=31, length=4>.

The length of a copy code (as measured in bits) will depend on themaximum token length of the region lexicon 830 and the maximum tokenlength of the block, the maximum allowed length of a matching sequence,and the number of distinct codes. In one example, the type field 902 is3 bits (allowing 8 type codes), the pointer field 908 is 7 bits and thelength field 910 is 2 bits, for a total of 12 bits. Other bit lengthsfor each field of a copy code may be used in other embodiments. Thelength of each literal code (as measured in bits) is specified by thetype of the literal code.

Referring back to FIG. 8B, as the encoding system 810 encodes the blocksof a region, the encoding system 810 generates a set of block offsets834 indicating the locations of the encoded tokens for each block of theregion. In one embodiment, the block offset of the first block of theregion is a pointer into the token repository, and each of the otherblock offsets for the region is a relative offset with respect to thestarting position of the first block in the region. In one embodimentthe region lexicons 830 and block offsets 834 are stored in a table 808or equivalent data structure that is indexed in accordance with thestarting positions of the regions 820 divided by the fixed region size.From another viewpoint, each region 820 is assigned a Region Numbercomprising its starting position divided by the fixed region size, andthe data structure(s) in which the region lexicons 830 and block offsets834 are stored are indexed by Region Number.

Decoding a block 822 of a region 820 is accomplished by locating theregion lexicon 830 of the corresponding region, locating the encodedblock using the block offsets 834 for the region, and then decoding theset of the codes for the block so as to produce a sequence of globaltoken identifiers. The resulting sequence of global token identifiers,or any subset thereof, may then be converted into a corresponding set ofsymbols or terms using the global lexicon 206.

Query Processing System

FIG. 4 is a block diagram of an embodiment of the first stage of a queryprocessing system 104 for use with a tokenspace repository. The queryprocessing system 104 includes a global-lexicon 402, a tokenspaceinverse index 408, a first stage look-up table 406 and a second stagelook-up table 410. Query terms or strings are received by theglobal-lexicon 402 which translates query terms into GTokenIDs using atranslation table or mapping built from entries of the global-lexicon402. The GTokenIDs are received by the inverse index 408, which includesa map 404 for mapping the GTokenIDs to index records 412 stored in theinverse index 408. Each index record 412 identified using the map 404contains a list of token positions, which directly correspond to tokenpositions in the tokenspace repository 112. In some embodiments, theinverse index 408 is generated after the global-lexicon is generated,and may be generated during the same pass through the documents that isused to generate the mini-lexicons.

In some embodiments, the inverse index 408 provides a list of positionswhich can be used as an index into the first stage look-up table 406.When the query contains multiple terms, multiple lists of positions areproduced by the inverse index 408. To avoid having to search the entireDocID map 410 for an entry corresponding to each position in the list(s)of positions, the first stage look-up table 406 has one entry 405 foreach block of positions in the tokenspace repository. For example, eachblock may have a size of 32,768 positions, and each entry may have apointer to a first entry in the DocID lookup table 410 for thecorresponding block of positions. Thus, the first stage look-up table406 translates the list(s) of positions into starting point positionsfor document identifier (DocID) entries 412 in the second stage look-uptable 410, which is sometimes called the DocID table 410. Alternately,tables 406 and 410 may be jointly called the DocID lookup table. Eachentry 412 in the second stage look-up table 410 includes a DocID(document identifier) and a starting repository position for thecorresponding document. The last token in any document is the positionimmediately prior to the starting position identified by the next entry412 in the second stage look-up table. The starting point positionsStart_Pos_(A-Z) for DocIDs are received by the second look-up table 410which translates the starting point positions into a list of DocIDs foreach of the query terms.

In some embodiments, the first stage query processor includes logic 416for producing a result set. The lists of DocIDs are merged by logic 416,in accordance with the Boolean logic specified by the query or querytree, to form a result set of DocIDs. The logic 416 may also optionallyfilter the lists of token positions to eliminate token positions notlocated within the documents corresponding to the DocIDs in the resultset. Furthermore, a scoring function may be applied to the result set,using the DocIDs and token positions within each document identified bythe DocIDs so as to associate a score (sometimes called a query score)with each DocID in the result set.

Multi-Stage Query Processing

FIG. 5 is a block diagram of an embodiment of a multi-stage queryprocessing system 500 for use with a tokenspace repository 524. In someembodiments, the query processing system 500 includes four stages ofquery processing and relevancy score generation, including a first stagequery processor 510, a second stage query processor 514, a third stagequery processor 518 and a fourth stage query processor 520. Note thatmore or fewer query processor stages can be used in the system 500depending upon the application. Each stage calculates one or more setsof relevancy scores which can be returned to the user and/or combinedwith relevancy scores generated in previous stages, depending upon theapplication.

Query Processing—Stage I

The first stage query processor 510 was generally described with respectto FIG. 4. A query string 502 is tokenized and parsed by a query parser504 into query terms (i.e., each distinct term in the query is treatedas a token). The tokenized query terms are translated by theglobal-lexicon 508 to corresponding GTokenIDs using a translation tableor mapping, as previously described with respect to FIGS. 2 and 4. Sinceusers may employ special operators in their query string, includingBoolean, adjacency, or proximity operators, the system 500 parses thequery into query terms and operators. These operators may occur in theform of reserved punctuation (e.g., quotation marks) or reserved termsin a specialized format (e.g., AND, OR). In the case of a naturallanguage processing (NLP) system, operators can be recognized implicitlyin the language used no matter how the operators might be expressed(e.g., prepositions, conjunctions, ordering, etc.). Other queryprocessing may also be included in the first stage query processor 510,such as deleting stop words (e.g., “a”, “the”, etc.) and term stemming(i.e., removing word suffixes).

Next, the list of GTokenIDs are processed by a query expander 506, whichgenerates a query tree or other query representation that takes intoaccount any operators used in the query string (e.g., a Booleanexpression). Optionally, the query expander 506 may also expand thequery in various ways. For instance, a query term may be converted intoa subtree containing the term and one or more synonym terms or otherterms related to the query term, with the terms in the subtree beingrelated to each other by an OR operator or parent node.

As will be described in more detail below, in some embodiments a queryis processed one or more times by the sequence of query processingstages shown in FIG. 5. On each pass (other than the last), additionalquery expansion terms are generated (as will be explained below), andthen these additional terms are added to the query tree. The query treecan also be used as a scoring tree, with weights being associated withterms in the query tree. The expanded query tree can also includesupplemental terms and subtrees of terms that are not required to bepresent in documents responsive to the query, but which are used inscoring the relevance of documents responsive to the query. If there ismore than one query term, during the first pass weights may be computedfor the query terms to improve the search results.

In some embodiments, the first pass through the system 500 processes arandom sample of documents from a document corpus. The size of therandom sample can be selected based on one or more smaller randomsamples that can be used by the system 500 to estimate a number ofdocuments that match the query across the document corpus. In otherembodiments, a first document corpus (e.g., a set of query sessions) isused in the first pass through the system 500 and a second, differentcorpus is used in a second or subsequent pass through the system 500.Using previous sets of query sessions enables the system 500 todetermine other related terms that commonly co-occur in similar queries.These related terms can be used by the query expander 506 to expand thequery for subsequent passes.

The first stage query processor 510 uses the query terms to searchagainst a tokenspace inverted index 512 and to identify documentsmatching the query. The first stage query processor 510 accesses theinverse index 512 to produce a list of token positions (also calledtokenspace repository positions) for terms in the query tree andaccesses the DocID Map 516 to produce a set of DocIDs for the documentscorresponding to the token positions. In addition, the first stageprocessor 510 performs the Boolean logic specified by the query or querytree so as to generate a set of DocIDs that are responsive to the query.In some embodiments, the first stage query processor 510 also computes afirst set of relevancy scores S₁ between the query and each documentbased on one or more scoring algorithms. In general, scoring algorithmsprovide relevancy rankings for each matching document based on one ormore query features, including but not limited to, the presence orabsence of query term(s), term frequency, Boolean logic fulfillment,query term weights, popularity of the documents (e.g., a queryindependent score of the document's importance or popularity orinterconnectedness), proximity of the query terms to each other,context, attributes, etc. In one embodiment, the first set of relevancyscores S₁ are based on a set of factors that include presence of queryterms, term frequency and document popularity.

In some embodiments, the first set of relevancy scores S₁ can be used toselect documents for presentation as an ordered list to the user, whocan then simply click and follow internal pointers to the selecteddocument. In other embodiments, the first set of relevancy scores S₁,together with DocIDs and corresponding positions, are provided to thesecond stage query processor 514 for further processing.

Query Processing—Stage II

The second stage query processor 514 receives a set of DocIDs, a list oftokenspace repository positions for the corresponding documents, and afirst set of relevancy scores S₁ from the first stage query processor510. The second stage query processor 514 uses the list of positions togenerate a second set of relevancy scores S₂ based on the proximity orrelative positions of query terms found in the documents. When the termsin a query occur near to each other within a document, it is more likelythat the document is relevant to the query than if the terms occur atgreater distance. Thus, the second set of relevancy scores S₂ are usedto rank documents higher if the query terms occur adjacent to oneanother or in close proximity, as compared to documents in which theterms occur at a distance. In some embodiments, the second set ofrelevancy scores S₂ can be used to select the top X documents forpresentation as an ordered list to the user, who can then simply clickand follow internal pointers to the selected document. In someembodiments, the second set of relevancy scores S₂ is derived in partfrom the first set of relevancy scores S₁ (e.g., by adjusting the S₁scores in accordance with the additional scoring factors used by thesecond stage query processor 514) to generate an ordered list ofdocuments (ordered in accordance with the second set of relevancy scoresS₂) for presentation to the user, and/or for further processing by thethird stage query processor 518.

Query Processing—Stage III

In some embodiments, the second stage query processor 514 is coupled toa third stage query processor 518 for handling term attributes (e.g.,font attributes, title, headings, metadata, etc.) which have beenencoded in an attribute table 522, as previously described with respectto FIG. 3C. The third stage query processor 518 receives a set ofDocIDs, a list of tokenspace repository positions for the correspondingdocuments, and the second set of relevancy scores S₂ from the secondstage query processor 514. Alternately, the third stage query processorreceives the first set of relevancy scores S₁ as well as the second setof relevancy scores S₂.

Some studies show that the location of a term in a document indicatesits significance to the document. For example, terms occurring in thetitle of a document that match a query term may be weighted more heavilythan query terms occurring in the body of the document. Similarly, queryterms occurring in section headings or the first paragraph of a documentare likely to be more indicative of the document's relevancy to thequery than terms occurring in less prominent positions within thedocument. Other attributes that may be used as indicators of relevancyinclude bolded text, underlined text and font size. Thus, the third setof scores S₃ are determined using the attributes of tokens in thedocuments that match the query terms. Referring to FIG. 3C, to accessthe attributes for the query terms in a document (i.e., the attributesof the tokens matching or relevant to the query terms), the tokenpositions of the query terms in the document are used to index into theattribute table 316 (522 in FIG. 5). More specifically, if the number oftokens whose attributes are encoded by each attribute record 318 is K,then the token positions divided by K are used to index into theattribute table 316. In some embodiments, the identified attributerecord or records 318 are stored in an encoded, compressed form, andthus must be decoded in order to determine the attributes associatedwith each of the query terms.

In some embodiments, the third set of relevancy scores S₃ can be used toselect the top Y documents for presentation as an ordered list to theuser, who can then simply click and follow internal pointers to theselected document. In some embodiments, the third set of relevancyscores S₃ is derived in part from one or more of the first and secondsets of relevancy scores S₁ and S₂, to generate an ordered list ofdocuments for presentation to the user, and/or for further processing bythe fourth stage query processor 520. In one embodiment, the S₃ scoresare produced by adjusting the S₂ scores in accordance with theadditional scoring factors produced by the third stage query processor518.

Query Processing—Stage IV

The fourth stage query processor 520 receives a set of DocIDs, a list ofpositions in the documents corresponding to the DocIDs, and the thirdset of relevancy scores S₃ from the third stage query processor 518. Thefourth stage query processor 520 may optionally receive the first and/orsecond sets of relevancy scores S₁ and S₂ as well. The fourth stagequery processor 520 is coupled to a decoding system 527, which in turnis coupled to one or more mini-lexicon maps 523, a tokenspace repository524 and one or more global-lexicon maps 508. The mini-lexicon maps 523,tokenspace repository 524 and global lexicon maps 508 were allpreviously described with respect to FIGS. 1 and 2.

The fourth stage query processor 520 generates a fourth set of relevancyscores S₄ based on context, and may also generate a “snippet” for one ormore of the documents listed in the result set. Snippets are smallportions of text from a document, and typically include text thatappears around the keywords being searched. In one embodiment, togenerate a snippet for a document listed in the result set, the queryprocessor decodes a predefined number of tokens positioned before andafter the first occurrence of each query term present in the document,thereby reconstructing one or more text portions of the document, andthen selects a subset of the text portions to include in the snippet.Using the list of positions in the result set, the decoding system 527can select the mini-lexicons 523 that are needed to decode the portionsof a document that precede and follow the occurrences of the query termsin the document. The selected mini-lexicons 523 and the global-lexicon508 are used to translate LTokenIDs in the tokenspace repository intoGTokenIDs, and to then translate the GTokenIDs into tokens, as describedabove with respect to FIG. 2.

In some embodiments, the fourth set of relevancy scores S₄ can be usedto select the top Z documents for presentation as an ordered list to theuser, who can then simply click and follow internal pointers to theselected document. In some embodiments, the fourth set of relevancyscores S₄ is derived in part from one or more of the first, second andthird sets of relevancy scores S₁, S₂ and S₃, to generate an orderedlist of documents for presentation to the user, and/or for furtherprocessing by a relevance feedback module 517. In an alternateembodiment, the last stage query processor generates snippets for thedocuments having the highest scores in the relevancy scores produced bythe preceding query processor stage, but does not generate a new set ofrelevancy scores S₄.

In some embodiments, the final set of relevancy scores are provided to arelevance feedback module 517 which generates one or more new queryexpansion terms based on documents in the result set produced by thelast query stage. For example, the relevance feedback module 517 couldimplement one or more known relevance feedback algorithms, including butnot limited to, pseudo-relevance feedback algorithms based on a fulldocument approach (pseudo relevance feedback based on a whole web page),Document Object Model (DOM) segmentation, Vision-based Page Segmentation(VIPS), conceptual relevance feedback using concept lattices, etc. Therelevance feedback algorithms can analyze the documents vetted from theprevious query processing stages and generate query expansion termsbased the results of the analysis. The new query expansion terms areprovided to the query expander 506 which generates a new queryexpression to be processed by one or more of the query processors 510,514, 518 and 520. Thus, the multi-stage query processing system 500 iscapable of executing two or more passes on a query, and usinginformation from each pass to generate improved queries which willultimately result in the user receiving more relevant documents.

In one embodiment, the last query stage processor 520 produces longsnippets when performing the first pass processing of a query, forexample including N (e.g., 10 to 40) tokens preceding and following eachoccurrence of the query terms in a document. The snippet may betruncated if it exceeds a predefined length. The query and the longsnippets produced by the last query stage 520 are provided to therelevance feedback module 517, along with the relevance scores, so as togenerate a set of query expansion terms, and, optionally, a set of queryterm weights as well. During a second pass processing of the expandedquery, the last query stage 520 produces short snippets, suitable inlength and content for display with the list of documents in the resultset having the highest or best scores.

In one embodiment, the query processing system contains L parallel queryprocessing sub-systems, each of which contains an inverse index 512 anda tokenspace repository 524 for a respective subset of a collection ofdocuments. For instance, a query processing system may include over athousand parallel query processing sub-systems. The relevance feedbackmodule 517 (FIG. 5) may be shared by all the query processingsub-systems. During a first pass through the query processing system,the query is processed by a small portion of the parallel queryprocessing sub-systems, while during a second pass the query isprocessed by the entire query processing system. For instance, the queryprocessing system may be divided into S subsets (e.g., 32 subsets), andeach query is assigned to one of the subsets in accordance with theresult of applying a hash function to a normalized version of the query,and then applying a modulo function to the result produced by the hashfunction. Each subset of the query processing system may be called a“partition” of the query processing system, and each query processingsub-system may be called a “sub-partition”.

The main purpose of the first pass processing of the query is to producea set of query expansion terms, and query term weights, so as to improvethe quality of the query results produced by the second pass processingof the query. As long as the documents in the query processing systemare fairly randomly distributed across the query processing sub-systems,the query needs to be processed by only a small number of sub-systems toproduce a set of query expansion terms. The query expansion terms areused by the query expander 506 to produce an expanded query tree orquery expression, which is then processed by the query processing stages(in a second pass processing of the query) as described above. Theresult set and snippets produced by the last query stage during thesecond pass may be formatted for display (or, more generally,presentation) by the computer or device from which the query wasreceived.

Document Processing Server

FIG. 6 is a block diagram of an embodiment of a tokenspace repositoryserver 600. The server 600 can be a stand alone computer system or partof a distributed processing system including multiple computer systems.The server 600 generally includes one or more processing units (CPUs)604, one or more network or other communications interfaces 608, memory602, and one or more communication buses 606 for interconnecting thesecomponents. The server 600 may optionally include a user interface, forinstance a display and a keyboard. Memory 602 may include high speedrandom access memory and may also include non-volatile memory, such asone or more magnetic disk storage devices. Memory 602 may include massstorage that is remotely located from the central processing unit(s)604.

The memory 602 stores an operating system 610 (e.g., Linux or Unix), anetwork communication module 612, a lexicon generator 614 (e.g., thelexicon generator 108), an encoding system 616 (e.g., encoding system300), one or more global-lexicons 618 (e.g., global-lexicon 206), one ormore mini-lexicons 620 (e.g., mini-lexicons 208), a tokenspacerepository 622 (e.g., tokenspace repository 112), attribute records 624(e.g., attribute records table 316), and a validity range map 626 (e.g.,validity range map 210). The operation of each of these components hasbeen previously described with respect to FIGS. 1-5.

Query Processing Server

FIG. 7 is a block diagram of an embodiment of a query processing server700. The server 700 can be a stand alone computer system or part of adistributed processing system including multiple computer systems. Theserver 700 generally includes one or more processing units (CPUs) 704,one or more network or other communications interfaces 708, memory 702,and one or more communication buses 706 for interconnecting thesecomponents. The server 700 may optionally include a user interface, forinstance a display and a keyboard. Memory 702 may include high speedrandom access memory and may also include non-volatile memory, such asone or more magnetic disk storage devices. Memory 702 may include massstorage that is remotely located from the central processing unit(s)704.

The memory 702 stores an operating system 710 (e.g., Linux or Unix), anetwork communication module 712, a tokenspace inverse index 714 (e.g.,tokenspace inverse index 408), a decoding system 716 (e.g., a decodingsystem 308), one or more lexicon translation tables or mappings 718(e.g., derived from global-lexicon 206 and mini-lexicons 208), avalidity range map 720 (e.g., validity range map 210), a DocID map 722(e.g., DocID map 410), a query parser 724 (e.g., query parser 504),query tree 726, one or more query processors 728 (e.g., query processors510, 514, 518 and 520), attribute records 730 (e.g., attribute recordstable 316), and a tokenspace repository 732 (e.g., tokenspace repository112). The operation of each of these components has been previouslydescribed with respect to FIGS. 1-5.

The foregoing description, for purpose of explanation, has beendescribed with reference to specific embodiments. However, theillustrative discussions above are not intended to be exhaustive or tolimit the invention to the precise forms disclosed. Many modificationsand variations are possible in view of the above teachings. Theembodiments were chosen and described in order to best explain theprinciples of the invention and its practical applications, to therebyenable others skilled in the art to best utilize the invention andvarious embodiments with various modifications as are suited to theparticular use contemplated.

What is claimed is:
 1. A query processing method, performed by a searchengine server system, comprising: receiving, from a user, a search queryhaving one or more query terms; in response to receiving the searchquery: translating the received search query into one or more predefinedtoken identifiers; finding token positions in a tokenspace repositorycorresponding to each predefined token identifier of the one or morepredefined token identifiers; translating, via a first lookup table, thetoken positions into one or more starting point positions for documentidentifier entries in a second lookup table, wherein respective documentidentifier entries in the second lookup table store respective documentidentifiers; translating, via the second lookup table, the one or morestarting point positions into a list of document identifiers, whereinthe document identifiers in the list are obtained from respectivedocument identifier entries in the second lookup table; and generating aresponse to the search query comprising information identifyingdocuments corresponding to at least a subset of document identifiers inthe list of document identifiers.
 2. The method of claim 1, wherein thereceived search query contains a plurality of terms; and finding thetoken positions includes generating a plurality of lists of tokenpositions, wherein each list corresponds to a respective search queryterm.
 3. The method of claim 1, wherein the first lookup table includesa respective entry for each block of a plurality of blocks of positionsin the tokenspace repository; and wherein translating the tokenpositions into the one or more starting point positions for documentidentifier entries comprises retrieving, for a respective tokenposition, a respective pointer to a starting point position from anentry in the first lookup table corresponding to the respective tokenposition.
 4. The method of claim 1, wherein each document identifierentry in the second lookup table includes a document identifier and astarting point position for a corresponding document; and whereintranslating the one or more starting point positions into the list ofdocument identifiers comprises retrieving, for a respective startingpoint position of the one or more starting point positions, a respectivedocument identifier from a document identifier entry in the secondlookup table corresponding to the respective starting point position. 5.The method of claim 4, wherein the tokenspace repository includesinitial and last token positions in the tokenspace repositorycorresponding to document identifiers for a set of documents; andwherein each starting point position corresponds to a token position inthe tokenspace repository immediately following a last token position inthe tokenspace repository for a respective document.
 6. The method ofclaim 1, further comprising generating a result set of documentidentifiers from the list of document identifiers in accordance withBoolean logic specified by the query.
 7. The method of claim 1, furthercomprising: identifying a document corresponding to a documentidentifier in the list of document identifiers; and generating a queryscore for the document based on token positions, corresponding to theone or more predefined token identifiers, within a range of tokenpositions in the tokenspace repository corresponding to the document. 8.A computer system for processing queries, comprising: memory; one ormore processors; and one or more programs stored in the memory andconfigured for execution by the one or more processors, the one or moreprograms including: instructions for receiving, from a client systemdistinct from the search engine server system, a search query having oneor more query terms; instructions for responding to receiving the searchquery, including, instructions for translating the received search queryinto one or more predefined token identifiers; instructions for findingtoken positions in a tokenspace repository corresponding to eachpredefined token identifier of the one or more predefined tokenidentifiers; instructions for translating, via a first lookup table, thetoken positions into one or more starting point positions for documentidentifier entries in a second lookup table, wherein respective documentidentifier entries in the second lookup table store respective documentidentifiers; instructions for translating, via the second lookup table,the one or more starting point positions into a list of documentidentifiers, wherein the document identifiers in the list are obtainedfrom respective document identifier entries in the second lookup table;and instructions for generating a response to the search querycomprising information identifying documents corresponding to at least asubset of document identifiers in the list of document identifiers. 9.The computer system of claim 8, wherein the received search querycontains a plurality of terms, the instructions for finding the tokenpositions include instructions for generating a plurality of lists oftoken positions, wherein each list corresponds to a respective searchquery term.
 10. The computer system of claim 8, wherein the first lookuptable includes a respective entry for each block of a plurality ofblocks of positions in the tokenspace repository; and wherein theinstructions for translating the token positions into the one or morestarting point positions for document identifier entries include theinstructions for retrieving, for a respective token position, arespective pointer to a starting point position from an entry in thefirst lookup table corresponding to the respective token position. 11.The computer system of claim 8, wherein each document identifier entryin the second lookup table includes a document identifier and a startingpoint position for a corresponding document; and wherein theinstructions for translating the one or more starting point positionsinto the list of document identifiers include the instructions forretrieving, for a respective starting point position of the one or morestarting point positions, a respective document identifier from adocument identifier entry in the second lookup table corresponding tothe respective starting point position.
 12. The computer system of claim11, wherein the tokenspace repository includes initial and last tokenpositions in the tokenspace repository corresponding to documentidentifiers for a set of documents; and wherein each starting pointposition corresponds to a token position in the tokenspace repositoryimmediately following a last token position in the tokenspace repositoryfor a respective document.
 13. The computer system of claim 8, the oneor more programs further comprising instructions for generating a resultset of document identifiers from the list of document identifiers inaccordance with Boolean logic specified by the query.
 14. The computersystem of claim 8, the one or more programs further comprising:instructions for identifying a document corresponding to a documentidentifier in the list of document identifiers; and instructions forgenerating a query score for the document based on token positions,corresponding to the one or more predefined token identifiers, within arange of token positions in the tokenspace repository corresponding tothe document.
 15. A non-transitory computer readable storage mediumstoring one or more programs to be executed by a computer system, theone or more programs comprising: instructions for receiving, from aclient system distinct from the search engine server system, a searchquery having one or more query terms; instructions for responding toreceiving the search query, including, instructions for translating thereceived search query into one or more predefined token identifiers;instructions for finding token positions in a tokenspace repositorycorresponding to each predefined token identifier of the one or morepredefined token identifiers; instructions for translating, via a firstlookup table, the token positions into one or more starting pointpositions for document identifier entries in a second lookup table,wherein respective document identifier entries in the second lookuptable store respective document identifiers; instructions fortranslating, via the second lookup table, the one or more starting pointpositions into a list of document identifiers, wherein the documentidentifiers in the list are obtained from respective document identifierentries in the second lookup table; and instructions for generating aresponse to the search query comprising information identifyingdocuments corresponding to at least a subset of document identifiers inthe list of document identifiers.
 16. The non-transitory computerreadable storage medium of claim 15, wherein the received search querycontains a plurality of terms, the instructions for finding the tokenpositions include instructions for generating a plurality of lists oftoken positions, wherein each list corresponds to a respective searchquery term.
 17. The non-transitory computer readable storage medium ofclaim 15, wherein the first lookup table includes a respective entry foreach block of a plurality of blocks of positions in the tokenspacerepository; and wherein the instructions for translating the tokenpositions into the one or more starting point positions for documentidentifier entries include the instructions for retrieving, for arespective token position, a respective pointer to a starting pointposition from an entry in the first lookup table corresponding to therespective token position.
 18. The non-transitory computer readablestorage medium of claim 15, wherein each document identifier entry inthe second lookup table includes a document identifier and a startingpoint position for a corresponding document; and wherein theinstructions for translating the one or more starting point positionsinto the list of document identifiers include the instructions forretrieving, for a respective starting point position of the one or morestarting point positions, a respective document identifier from adocument identifier entry in the second lookup table corresponding tothe respective starting point position.
 19. The non-transitory computerreadable storage medium of claim 18, wherein the tokenspace repositoryincludes initial and last token positions in the tokenspace repositorycorresponding to document identifiers for a set of documents; andwherein each starting point position corresponds to a token position inthe tokenspace repository immediately following a last token position inthe tokenspace repository for a respective document.
 20. Thenon-transitory computer readable storage medium of claim 15, the one ormore programs further comprising instructions for generating a resultset of document identifiers from the list of document identifiers inaccordance with Boolean logic specified by the query.
 21. Thenon-transitory computer readable storage medium of claim 15, the one ormore programs further comprising: instructions for identifying adocument corresponding to a document identifier in the list of documentidentifiers; and instructions for generating a query score for thedocument based on token positions, corresponding to the one or morepredefined token identifiers, within a range of token positions in thetokenspace repository corresponding to the document.